A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation
نویسنده
چکیده
We present a new method, called the minimum cross-entropy (MCE) method for approximating the optimal solution of NP-hard combinatorial optimization problems and rare-event probability estimation, which can be viewed as an alternative to the standard cross entropy (CE) method. The MCE method presents a generic adaptive stochastic version of Kullback’s classic MinxEnt method. We discuss its similarities and differences with the standard cross-entropy (CE) method and prove its convergence. We show numerically that MCE is a little more accurate than CE, but at the same time a little slower than CE. We also present a new method for trajectory generation for TSP and some related problems. We finally give some numerical results using MCE for rare-events probability estimation for simple static models, the maximal cut problem and the TSP, and point out some new areas of possible applications. 0† This research was supported by the Israel Science Foundation (grant No 191-565)
منابع مشابه
Generalized Cross-entropy Methods with Applications to Rare-event Simulation and Optimization
The cross-entropy and minimum cross-entropy methods are well-known Monte Carlo simulation techniques for rare-event probability estimation and optimization. In this paper, we investigate how these methods can be extended to provide a general non-parametric cross-entropy framework based on 1-divergence distance measures. We show how the 2 2 distance, in particular, yields a viable alternative to...
متن کاملCross-Entropy Method
The cross-entropy method is a recent versatile Monte Carlo technique. This article provides a brief introduction to the cross-entropy method and discusses how it can be used for rare-event probability estimation and for solving combinatorial, continuous, constrained and noisy optimization problems. A comprehensive list of references on cross-entropy methods and applications is included.
متن کاملGeneralized Cross-Entropy Methods
The cross-entropy and minimum cross-entropy methods are well-known Monte Carlo simulation techniques for rare-event probability estimation and optimization. In this paper we investigate how these methods can be extended to provide a general non-parametric cross-entropy framework based on φ-divergence distance measures. We show how the χ distance in particular yields a viable alternative to Kull...
متن کاملAn Efficient Algorithm for Rare-event Probability Estimation, Combinatorial Optimization, and Counting
Although importance sampling is an established and effective sampling and estimation technique, it becomes unstable and unreliable for highdimensional problems. The main reason is that the likelihood ratio in the importance sampling estimator degenerates when the dimension of the problem becomes large. Various remedies to this problem have been suggested, including heuristics such as resampling...
متن کاملar X iv : m at h / 05 09 35 2 v 1 [ m at h . O C ] 1 5 Se p 20 05 ROBUST ROUTING AND CROSS - ENTROPY ESTIMATION
In this article we present a novel way to estimate the amounts of traffic on the OriginDestination couples (OD couples). This new approach combines together a routing algorithm based on the principle of the shortest path and a recent technique of stochastic optimization called Cross-Entropy. The CE method was built at the origin, to tackle problems of rare-event simulation. However, its invento...
متن کامل